Properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16

نویسندگان

  • George K. Guskov
  • Faina I. Solov'eva
چکیده

Properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 Abstract. Some properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 are presented for reference purposes. The attached files contain some tab-delimited properties of perfect binary codes of length 15 and extended perfect codes of length 16. Classification of such codes can be found in [1], but unfortunately the list of such codes' properties was not attached to the paper. We acknowledge that such properties had been computated by the authors in [1] and our results are presented for reference purposes only. The attached files are perfect15.txt contains a list of properties of all perfect codes of length 15. The properties are: index of the code in classification [1], rank, dimension of the kernel. perfect16.txt contains a list of properties of all extended perfect codes of length 16. The properties are: index of the code in classification [1], rank, dimension of the kernel. transitive15.txt contains a list of properties of all perfect transitive codes of length 15. The properties are: index of the code in classification [1], rank, dimension of the code's kernel, order of the code's automorphism group, number of codewords of weight 3 in the set C + C, order of the code's symmetry group. transitive16.txt contains a list of properties of all extended perfect transitive codes of length 16. The properties are: index of the code in classification [1], rank, dimension of the code's kernel, order of the code's automorphism group, number of codewords of weight 4 in the set C + C, order of the code's symmetry group. All computations have been carried out by using Magma [2] system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Number of Nonequivalent Propelinear Extended Perfect Codes

The paper proves that there exists an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov (2007) are propelinear. All such codes have small rank, which is one more than the rank of the extended Hamming code of the same length. We investigate the ...

متن کامل

The (non-)existence of perfect codes in Lucas cubes

A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...

متن کامل

The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5 983 such inequivalent perfect codes and 2 165 extended perfect codes. Efficient generation of these codes relies on the recent classification of Steiner quadruple systems of order 16. Utilizing a result of Blackmore, the optimal binary one-er...

متن کامل

An enumeration of 1-perfect binary codes

We enumerate the extended perfect I-error correcting binary codes of length 16 which can be constructed by the concatenation or doubling construction. In the process, we establish some properties of these codes and consider algorithms that effectively establish the nonequivalence of these codes.

متن کامل

The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties

A complete classification of the perfect binary oneerror-correcting codes of length 15 as well as their extensions of length 16 was recently carried out in [P. R. J. Östergård and O. Pottonen, “The perfect binary one-error-correcting codes of length 15: Part I—Classification,” submitted for publication]. In the current accompanying work, the classified codes are studied in great detail, and the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1210.5940  شماره 

صفحات  -

تاریخ انتشار 2012